Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
121	Moment methods in extremal geometry Proefschrift ter verkrijging van de graad van doctor aan de Technische Universiteit Delft, op gezag van de Rector Magnificus prof. ir. K.C.A.M. Luyben, Add to Reading List Source URL: www.daviddelaat.nl Language: English Mathematical optimization Operations research Discrete geometry Convex optimization Packing problems Sphere packing Semidefinite programming Linear programming Conic optimization Relaxation Kepler conjecture Optimization problem
122	A Truthful-in-expectation Mechanism for the Generalized Assignment Problem Salman Fadaei and Martin Bichler Department of Informatics, TU München, Munich, Germany , Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2015-07-06 06:27:57 Game theory Convex optimization Linear programming Operations research Mechanism design Expected value VickreyClarkeGroves auction Submodular set function
123	BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-06-20 11:55:09 Operations research Foreign relations of Brazil Foreign relations of India Computational geometry Linear programming LP-type problem Emo Welzl Mathematical optimization Bounding sphere BRIC Randomization
124	Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T. Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 NP-complete problems Approximation algorithms Operations research Facility location problem Combinatorial optimization Steiner tree problem APX Draft:Sub-linear time algorithm Planar separator theorem
125	APPROXIMATE DYNAMIC PROGRAMMING A SERIES OF LECTURES GIVEN AT TSINGHUA UNIVERSITY JUNE 2014 DIMITRI P. BERTSEKAS Based on the books: Add to Reading List Source URL: athenasc.com Language: English - Date: 2014-06-21 10:19:49 Mathematical optimization Operations research Equations Optimal control Dynamic programming Dimitri Bertsekas Bellman equation Optimization problem Algorithm Reinforcement learning
126	CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-05 01:13:23 Combinatorial optimization Linear programming relaxation Maximum flow problem Maximum cut Linear programming Cut Candidate solution Randomized algorithm Max-flow min-cut theorem Randomized rounding
127	Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I Add to Reading List Source URL: www.tmrfindia.org Language: English - Date: 2008-11-10 09:49:21 Matroid theory Matroid Weighted matroid Uniform matroid Graphic matroid Greedy algorithm Dynamic programming Greedoid Matroid minor
128	Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg Add to Reading List Source URL: ad-publications.informatik.uni-freiburg.de Language: English - Date: 2013-04-29 10:40:39 NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network
129	Experimental evaluation of modern variable selection strategies in Constraint Satisfaction Problems Thanasis Balafoutis1 and Kostas Stergiou1 Department of Information & Communication Systems Engineering University of th Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2008-11-28 08:00:26 Constraint programming Operations research Constraint satisfaction problem Local consistency Mathematical optimization Heuristic Integer programming Constraint satisfaction Search algorithm Local search Look-ahead Decomposition method
130	The Complexity of Rationalizing Matchings Shankar Kalyanaraman∗ Computer Science Department California Institute of Technology Pasadena, CA 91125 Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-03-10 14:13:07 Matching Combinatorics Combinatorial optimization Stable marriage problem CC

UPDATE